#include "common.hpp"
#include "item.hpp"

void itemPriorList::push_back(const std::shared_ptr<item> val)
{
	// uses linear search - could swap to binary, lazy.
	auto it = this->begin();
	while( (*it)->rPriority < val->rPriority )
	{
		it++;
	}
	this->insert(it, val);
}
